Trust-region superposition methods for protein alignment

نویسندگان

  • R. ANDREANI
  • J. M. MARTÍNEZ
چکیده

Protein alignment is a challenging applied optimization problem. Superposition methods are based on the maximization of a score function with respect to rigid-body modifications of relative positions. The problem of score maximization can be modelled as a continuous nonsmooth optimization problem (low order-value optimization (LOVO)). This allows one to define practical and convergent methods that produce monotone increases of the score. In this paper, trust-region methods are introduced for solving the problem. Numerical results are presented. Computer software related to the LOVO approach for protein alignment is available at www.ime.unicamp.br/∼martinez/lovoalign.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations

In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations‎. ‎One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region approach‎. ‎Each of methods showed fast convergence in special problems and slow convergence in other o...

متن کامل

Structure comparison and alignment.

Since the 1970s, after the seminal work of Rossmann and Argos (1978) comparing binding sites of known enzyme structures, the comparison and alignment of protein structures has come to be a fundamental and widely used task in computational structure biology. Three main steps are needed for comparing two protein structures: first, the detection of their common similarities; second, the alignment ...

متن کامل

Point Dose Measurement for Verification of Treatment Planning System using an Indigenous Heterogeneous Pelvis Phantom for Clarkson, Convolution, Superposition, and Fast Superposition Algorithms

Background: Nowadays, advanced radiotherapy equipment includes algorithms to calculate dose. The verification of the calculated doses is important to achieve accurate results. Mostly homogeneous dosimetric phantoms are available commercially which do not mimic the actual patient anatomy; therefore, an indigenous heterogeneous pelvic phantom mimicking actual human pelvic region has been used to ...

متن کامل

An iterative refinement algorithm for consistency based multiple structural alignment methods

MOTIVATION Multiple STructural Alignment (MSTA) provides valuable information for solving problems such as fold recognition. The consistency-based approach tries to find conflict-free subsets of alignments from a pre-computed all-to-all Pairwise Alignment Library (PAL). If large proportions of conflicts exist in the library, consistency can be hard to get. On the other hand, multiple structural...

متن کامل

A New Strategy for Choosing the Radius Adjusting Parameters in Trust Region Methods

Trust region methods are a class of important and efficient methods for solving unconstrained optimization problems. The efficiency of these methods strongly depends on the initial parameter, especially radius adjusting parameters. In this paper, we propose a new strategy for choosing the radius adjusting parameters. Numerical results from testing the new idea to solve a class of unconstrained ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007